首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   84549篇
  免费   1861篇
  国内免费   1301篇
化学   28983篇
晶体学   897篇
力学   7100篇
综合类   89篇
数学   32721篇
物理学   17921篇
  2023年   225篇
  2022年   232篇
  2021年   312篇
  2020年   440篇
  2019年   409篇
  2018年   10675篇
  2017年   10500篇
  2016年   6426篇
  2015年   1248篇
  2014年   735篇
  2013年   907篇
  2012年   4434篇
  2011年   11133篇
  2010年   6103篇
  2009年   6460篇
  2008年   6981篇
  2007年   9088篇
  2006年   526篇
  2005年   1581篇
  2004年   1754篇
  2003年   2157篇
  2002年   1180篇
  2001年   396篇
  2000年   394篇
  1999年   287篇
  1998年   293篇
  1997年   233篇
  1996年   279篇
  1995年   191篇
  1994年   138篇
  1993年   136篇
  1992年   87篇
  1991年   108篇
  1990年   90篇
  1989年   84篇
  1988年   79篇
  1987年   75篇
  1986年   70篇
  1985年   59篇
  1984年   44篇
  1983年   39篇
  1982年   47篇
  1981年   44篇
  1980年   50篇
  1979年   44篇
  1914年   45篇
  1913年   40篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
111.
In this paper, we describe an aircraft loading problem submitted by the French military agency (DGA) as part of a more general military airlift planning problem. It can be viewed as a kind of bi-dimensional bin-packing problem, with heterogeneous bins and several additional constraints. We introduce two-phase methods for solving this NP-hard problem. The first phase consists in building good initial solutions, thanks to two fast algorithms: a list-based heuristic and a loading pattern generation method. Both algorithms call a constraint-based subroutine, able to determine quickly if the items already loaded can be reshuffled to accommodate a new object. The second phase improves these preliminary solutions using local search techniques. Results obtained on real data sets are presented.  相似文献   
112.
This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1.  相似文献   
113.
Nicholas Nathan tries to resist the current version of the causal argument for sense-data in two ways. First he suggests that, on what he considers to be the correct re-construction of the argument, it equivocates on the sense of proximate cause. Second he defends a form of disjunctivism, by claiming that there might be an extra mechanism involved in producing veridical hallucination, that is not present in perception. I argue that Nathan’s reconstruction of the argument is not the appropriate one, and that, properly interpreted, the argument does not equivocate on proximate cause. Furthermore, I claim that his postulation of a modified mechanism for hallucinations is implausibly ad hoc.  相似文献   
114.
 The paper establishes lower bounds on the provability of 𝒟=NP and the MRDP theorem in weak fragments of arithmetic. The theory I 5 E 1 is shown to be unable to prove 𝒟=NP. This non-provability result is used to show that I 5 E 1 cannot prove the MRDP theorem. On the other hand it is shown that I 1 E 1 proves 𝒟 contains all predicates of the form (∀i≤|b|)P(i,x)^Q(i,x) where ^ is =, <, or ≤, and I 0 E 1 proves 𝒟 contains all predicates of the form (∀ib)P(i,x)=Q(i,x). Here P and Q are polynomials. A conjecture is made that 𝒟 contains NLOGTIME. However, it is shown that this conjecture would not be sufficient to imply 𝒟=N P. Weak reductions to equality are then considered as a way of showing 𝒟=NP. It is shown that the bit-wise less than predicate, ≤2, and equality are both co-NLOGTIME complete under FDLOGTIME reductions. This is used to show that if the FDLOGTIME functions are definable in 𝒟 then 𝒟=N P. Received: 13 July 2001 / Revised version: 9 April 2002 / Published online: 19 December 2002 Key words or phrases: Bounded Arithmetic – Bounded Diophantine Complexity  相似文献   
115.
116.
 This paper generalizes results of F. K?rner from [4] where she established the existence of maximal automorphisms (i.e. automorphisms moving all non-algebraic elements). An ω-maximal automorphism is an automorphism whose powers are maximal automorphisms. We prove that any structure has an elementary extension with an ω-maximal automorphism. We also show the existence of ω-maximal automorphisms in all countable arithmetically saturated structures. Further we describe the pairs of tuples (ˉab) for which there is an ω-maximal automorphism mapping ˉa to ˉb. Received: 12 December 2001 / Published online: 10 October 2002 Supported by the ``Fonds pour la Formation à la Recherche dans l'Industrie et dans l'Agriculture' Mathematics Subject Classification (2000): Primary: 03C50; Secondary: 03C57 Key words or phrases: Automorphism – Recursively saturated structure  相似文献   
117.
This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions are provided.  相似文献   
118.
Taking advantage of our knowledge of the capacity of DIBAL-H to de-O-alkylate, we propose an alternative mechanism for a spiroketal rearrangement described by E. Suàrez. We also show that this proposal can account for the formation of the secondary product, whose original structure we propose to correct.  相似文献   
119.
A technique is described for the measurement of all components of mean velocity and Reynolds stresses, in a complex turbulent flow where achieving coincidence data acquisition is difficult. The method is based on data recorded using four orientations of the laser probe. It is shown that the measurement errors are not the same for all the components of the Reynolds tensor, but they are sufficiently small to give a good accuracy. An application to a turbomachinery flow is given to illustrate the method.  相似文献   
120.
A novel super-hydrophobic stearic acid (STA) film with a water contact angle of 166o was prepared by chemical adsorption on aluminum wafer coated with polyethyleneimine (PEI) film. The micro-tribological behavior of the super-hydrophobic STA monolayer was compared with that of the polished and PEI-coated Al surfaces. The effect of relative humidity on the adhesion and friction was investigated as well. It was found that the STA monolayer showed decreased friction, while the adhesive force was greatly decreased by increasing the surface roughness of the Al wafer to reduce the contact area between the atomic force microscope (AFM) tip and the sample surface to be tested. Thus the friction and adhesion of the Al wafer was effectively decreased by generating the STA monolayer, which indicated that it could be feasible and rational to prepare a surface with good adhesion resistance and lubricity by properly controlling the surface morphology and the chemical composition. Both the adhesion and friction decreased as the relative humidity was lowered from 65% to 10%, though the decrease extent became insignificant for the STA monolayer. The project supported by the National Natural Science Foundation of China (50375151, 50323007, 10225209) and the Chinese Academy of Sciences (KJCX-SW-L2)  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号